General Gutman Index of a Graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationship between Edge-wiener Index and Gutman Index of a Graph

The Wiener indexW (G) of a connected graphG is defined to be the sum ∑ u,v d(u, v) of the distances between the pairs of vertices in G. Similarly, the edge-Wiener index We(G) of G is defined to be the sum ∑ e,f d(e, f) of the distances between the pairs of edges in G, or equivalently, the Wiener index of the line graph L(G). Finally, the Gutman index Gut(G) is defined to be the sum ∑ u,v deg(u)...

متن کامل

Bounds on Gutman Index

The Gutman index (also known as Schultz index of the second kind) of a graph G is defined as Gut(G) = ∑ u,v∈V (G) d(u)d(v)d(u, v). We show that among all graphs on n vertices, the star graph Sn has minimal Gutman index. In addition, we present upper and lower bounds on Gutman index for graphs with minimal and graphs with maximal Gutman index. Corresponding author Supported by project 1M0545 of ...

متن کامل

Ashwini Index of a ‎Graph

Motivated by the terminal Wiener index‎, ‎we define the Ashwini index $mathcal{A}$ of trees as‎ begin{eqnarray*}‎ % ‎nonumber to remove numbering (before each equation)‎ ‎mathcal{A}(T) &=& sumlimits_{1leq i

متن کامل

The Multiplicative Versions of the Reciprocal Degree Distance and Reciprocal Gutman Index of Some Graph Products

In this paper, we provide exact value of the multiplicative version of the reciprocal degree distance and the multiplicative version of the reciprocal Gutman index of Cartesian product of complete graphs. Also, we establish sharp upper bounds for the multiplicative version of the reciprocal degree distance and multiplicative version of the reciprocal Gutman index of strong product of graphs.

متن کامل

General neighbour-distinguishing index of a graph

It is proved that edges of a graph G can be coloured using χ(G) + 2 colours so that any two adjacent vertices have distinct sets of colours of their incident edges. In the case of a bipartite graph three colours are sufficient.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Match

سال: 2023

ISSN: ['0340-6253']

DOI: https://doi.org/10.46793/match.89-3.583d